New Constructions for De Bruijn Tori

نویسندگان

  • Glenn H. Hurlbert
  • Garth Isaak
چکیده

A De Bruijn torus is a periodic d−dimensional k−ary array such that each n1 × · · · × nd k−ary array appears exactly once with the same period. We describe two new methods of constructing such arrays. The first is a type of product that constructs a k1k2−ary torus from a k1−ary torus and a k2−ary torus. The second uses a decomposition of a d-dimensional torus to produce a d + 1 dimensional torus. Both constructions will produce two dimensional k−ary tori for which the period is not a power of k. In particular, for k = Πpl l and for all natural numbers (n1, n2), we construct 2-dimensional k−ary De Bruijn tori with order 〈n1, n2〉 and period 〈q, k 12/q〉 where q = kΠp pl n1c l .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding Cartesian Products of Graphs into de Bruijn Graphs

Integration of concepts for the parallelization of image processing algorithms into parallel compiler technology. Abstract Given a Cartesian product G = G 1 : : : G m (m 2) of nontrivial connected graphs G i and the n{dimensional base B de Bruijn graph D = D B (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G 1 : : : G m which are relev...

متن کامل

A MESHING TECHNIQUE FOR de BRUIJN TORI

An (R, S; m, n)k-de Bruijn torus is a k-ary R × S toroidal array with the property that every k-ary m × n matrix appears exactly once contiguously on the torus. The torus is a generalization of de Bruijn cycles and has been extended to higher dimensions by many authors. The central question, asked by Chung, Diaconis, and Graham, is for which R, S, m, n, and k such tori exist. In this note we de...

متن کامل

Decoding Perfect Maps

Perfect Maps are two-dimensional arrays in which every possible sub-array of a certain size occurs exactly once. They are a generalisation of the de Bruijn sequences to two dimensions and are of practical significance in certain position location applications. In such applications the decoding problem, i.e. resolving the position of a particular sub-array within a specified Perfect Map, is of g...

متن کامل

Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three

Given a Cartesian product G = GI x x G,, (m > 2) of nontrivial connected graphs G, and the base d, dimension D de Bruijn graph B(d,D), it is investigated under which conditions G is (or is not) a subgraph of B(d, D). We present a complete solution of this problem for the case D 3 4. For D = 3, we give partial results including a complete solution for the case that G is a torus, i.e., G is the C...

متن کامل

A Formalization of a Concurrent Object Calculus up to -conversion

We experiment a method for representing a concurrent object calculus in the Calculus of Inductive Constructions. Terms are rst deened in de Bruijn style, then names are reintroduced in binders. The terms of the calculus are formalized in the mechanized logic by suitable subsets of the de Bruijn terms; namely those whose de Bruijn indices are relayed beyond the scene. The-equivalence relation is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1995